Random Search is Parsimonious
نویسنده
چکیده
We model in detail the distribution of Boolean functions implemented by random non-recursive programs, similar to linear genetic programming. Most functions are constants , the remainder are mostly simple. Bounds on how long programs need to be before the distribution of their functionality is close to its limiting distribution are provided in general and for average computers.
منابع مشابه
A Queuing Network Model for Eye Movement
Eye movement is a basic human behavior that offers a valuable means to explore human cognitive processes. This article introduces two modeling studies of eye movement. First, random menu search was modeled using a queueing network approach and second, a reinforcement learning algorithm was used to generate various eye movement patterns. Random menu search is a task component involved in many hu...
متن کاملAn approach for constructing parsimonious generalized Gaussian kernel regression models
The paper proposes a novel construction algorithm for generalized Gaussian kernel regression models. Each kernel regressor in the generalized Gaussian kernel regression model has an individual diagonal covariance matrix, which is determined by maximizing the correlation between the training data and the regressor using a repeated guided random search based on boosting optimization. The standard...
متن کاملAugmented Downhill Simplex a Modified Heuristic Optimization Method
Augmented Downhill Simplex Method (ADSM) is introduced here, that is a heuristic combination of Downhill Simplex Method (DSM) with Random Search algorithm. In fact, DSM is an interpretable nonlinear local optimization method. However, it is a local exploitation algorithm; so, it can be trapped in a local minimum. In contrast, random search is a global exploration, but less efficient. Here, rand...
متن کاملRandom gravitational emulation search algorithm (RGES (in scheduling traveling salesman problem
this article proposes a new algorithm for finding a good approximate set of non-dominated solutions for solving generalized traveling salesman problem. Random gravitational emulation search algorithm (RGES (is presented for solving traveling salesman problem. The algorithm based on random search concepts, and uses two parameters, speed and force of gravity in physics. The proposed algorithm is ...
متن کاملProfile and Height of Random Binary Search Trees
The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.
متن کامل